Coalgebraic Modal Logic in CoCasl
نویسندگان
چکیده
We extend the algebraic-coalgebraic specification language CoCasl by full coalgebraic modal logic based on predicate liftings for functors. This logic is more general than the modal logic previously used in CoCasl and supports the specification of a variety of modal logics, such as graded modal logic, majority logic, and probabilistic modal logic. CoCasl thus becomes a modern modal language that covers a wide range of Kripke and non-Kripke semantics of modal logics via the coalgebraic interpretation.
منابع مشابه
Algebraic-Coalgebraic Specification in Co Casl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. Moreover, it provides syntactic sugar for an observer-indexed modal logic that allows e.g. expressing fairness properties. This logic includes a generic definition of modal operators fo...
متن کاملSpecification-Based Testing for CoCasl's Modal Specifications
Specification-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal specification. We present in this paper an extension of the most popular and most efficient selection method widely used in the algebraic framework, called axiom unfolding, to coalgebraic specifications, using the modal logic provided by the CoCasl specificat...
متن کاملModelling Process Algebra
CoCasl [11], a recently developed coalgebraic extension of the algebraic specification language Casl [2], allows for modelling systems in terms of inductive datatypes as well as of co-inductive process types. Here, we demonstrate how to specify process algebras, namely CCS [10] and CSP [8,17], within such an algebraic-coalgebraic framework. It turns out that CoCasl can deal with the fundamental...
متن کاملSpeci cation-Based Testing for CoCasl's Modal Speci cations
Speci cation-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal speci cation. In the framework of algebraic speci cations, the method for selecting test cases which has widely and e ciently been applied is called axiom unfolding. It has been shown e cient both in terms of quality of the resulting test set, which has been p...
متن کاملA Finite Model Construction for Coalgebraic Modal Logic
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal...
متن کامل